package offer;

public class EX13 {
    public int cuttingRope(int n) {
        int[] dp = new int[n+1];
        dp[0] = 0;
        dp[1] = 0;

        for (int i = 2; i <= n; i++) {
            for (int j = 1; j < i; j++) {
                dp[i] = Math.max(j*(i-j),(i-j)*dp[j]);
            }
        }
        return dp[n];

    }
}
